Minimum distance and the minimum weight codewords of Schubert codes
نویسندگان
چکیده
منابع مشابه
Minimum distance and the minimum weight codewords of Schubert codes
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by Xiang. We give an alternative proof of this formula. Further, we propose a characterization of the minimum weight codewords of Schubert codes by introducing the n...
متن کاملMinimum-weight codewords as generators of generalized Reed-Muller codes
We establish the range of values of ρ, where 0 ≤ ρ ≤ m(q − 1), for which the generalized Reed-Muller code RFq (ρ,m) of length q over the field Fq of order q is spanned by its minimum-weight vectors.
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملStudying the locator polynomials of minimum weight codewords of BCH codes
We consider only primitive binary cyclic codes of length n = 2 m ? 1. A BCH-code with designed distance is denoted B(n;). A BCH-code is always a narrow-sense BCH-code. A codeword is identiied with its locator polynomial, whose coeecients are the symmetric functions of the locators. The deenition of the code by its zeros-set involves some properties for the power sums of the locators. Moreover t...
متن کاملA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2018
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2017.08.014